DBtk: A Toolkit for Directed Bigraphs
نویسندگان
چکیده
We present DBtk, a toolkit for Directed Bigraphs. DBtk supports a textual language for directed bigraphs, the graphical visualization of bigraphs, the calculation of IPO labels, and the calculation of redex matchings. Therefore, this toolkit provides the main functions needed to implement simulators and verification tools.
منابع مشابه
Directed Bigraphs : Theory and Applications ∗ Davide Grohmann Marino
We introduce directed bigraphs, a bigraphical meta-model for describing computational paradigms dealing with locations and resource communications. Directed bigraphs subsume and generalize both original Milner’s and Sassone-Sobociński’s variants of bigraphs. The key novelty is that directed bigraphs take account of the “resource request flow” inside link graphs, from controls to edges (through ...
متن کاملAn Algebra for Directed Bigraphs
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generalization of other variants of bigraphs. We give a sound and complete axiomatization of the (pre)category of directed bigraphs. Using this axiomatization, we give an adequate encoding of the Fusion calculus, showing the uti...
متن کاملDirected Bigraphs
We introduce directed bigraphs, a bigraphical meta-model for describing computational paradigms dealing with locations and resource communications. Directed bigraphs subsume and generalize both original Milner’s and Sassone-Sobociński’s variants of bigraphs. The key novelty is that directed bigraphs take account of the “resource request flow” inside link graphs, from controls to edges (through ...
متن کاملPermutation bigraphs and interval containments
A bipartite graph with partite sets X and Y is a permutation bigraph if there are two linear orderings of its vertices so that xy is an edge for x ∈ X and y ∈ Y if and only if x appears later than y in the first ordering and earlier than y in the second ordering. We characterize permutation bigraphs in terms of representations using intervals. We determine which permutation bigraphs are interva...
متن کاملReactive Systems over Directed Bigraphs
We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational meta-model which subsumes other variants of bigraphs. First we consider wide transition systems whose labels are all those generated by the IPO construction; the corresponding bisimulation is always a congruence. Then, we show that these LTSs can be simplified further b...
متن کامل